Effect of genesis on the properties and hydrogen reducibility of NiO-ZnO mixed oxides

The physico-chemical properties and reactivity tested by hydrogen reduction have been studied for two series of NiO-ZnO mixed oxides of various composition. The solid nickel oxide or zinc oxide in interaction with the solution of nitrate of the second component were used as the precursors in each series. The differences in some physico-chemical parameters of the samples in both series were correlated with their reduction behaviour, followed both in iso- and non-isothermal regime. Moreower, the influence of various factors modifying the reactivity of mixed oxides was also investigated and the results were compared with those obtained from earlier studied analogous systems of quite different origin.This revised version was published online in November 2005 with corrections to the Cover Date.     

Determining radii of meromorphy via orthogonal polynomials on the unit circle

Using a convergence theorem for Fourier–Padé approximants constructed from orthogonal polynomials on the unit circle, we prove an analogue of Hadamard's theorem for determining the radius of m-meromorphy of a function analytic on the unit disk and apply this to the location of poles of the reciprocal of Szeg functions.     

Asymptotic properties of computationally efficient alternative estimators for a class of multivariate normal models

Parameters of Gaussian multivariate models are often estimated using the maximum likelihood approach. In spite of its merits, this methodology is not practical when the sample size is very large, as, for example, in the case of massive georeferenced data sets. In this paper, we study the asymptotic properties of the estimators that minimize three alternatives to the likelihood function, designed to increase the computational efficiency. This is achieved by applying the information sandwich technique to expansions of the pseudo-likelihood functions as quadratic forms of independent normal random variables. Theoretical calculations are given for a first-order autoregressive time series and then extended to a two-dimensional autoregressive process on a lattice. We compare the efficiency of the three estimators to that of the maximum likelihood estimator as well as among themselves, using numerical calculations of the theoretical results and simulations.     

Dihalodimethyltin(IV) complexes of 2‐(pyrazol‐1‐ylmethyl)pyridine

Reaction of dichloro‐ and dibromodimethyltin(IV) with 2‐(pyrazol‐1‐ylmethyl)pyridine (PMP) afforded [SnMe₂Cl₂(PMP)] and [SnMe₂Br₂(PMP)] respectively. The new complexes were characterized by elemental analysis and mass spectrometry and by IR, Raman and NMR (¹H, ¹³C) spectroscopies. Structural studies by X‐ray diffraction techniques show that the compounds consist of discrete units with the tin atom octahedrally coordinated to the carbon atoms of the two methyl groups in a trans disposition (Sn? C = 2.097(5), 2.120(5) Å and 2.110(6), 2.121(6) Å in the chloro and in the bromo compounds respectively), two cis halogen atoms (Sn? Cl = 2.4908(16), 2.5447(17) Å; Sn? Br = 2.6875(11), 2.7464(9) Å) and the two donor atoms of the ligand (Sn? N = 2.407(4), 2.471(4) Å and 2.360(5), 2.455(5) Å). In both cases, the Sn? N(pyridine) bond length is markedly longer than the Sn? N(pyrazole) distance. Copyright © 2003 John Wiley & Sons, Ltd.     

Lanthanum nitrate decomposition by both temperature programmed heating and citrate gel combustion

Thermal decomposition of lanthanum nitrate to lanthanum oxide was carried out by both temperature programmed heating (TPH) and citrate-gel combustion. The temperature programmed heating was carried out under flow of oxidizing (air), neutral (nitrogen) and reducing (25 vol.% hydrogen+argone mixture) gases, and the processes were controlled by simultaneous thermogravimetry and differential thermal analysis. It was shown that hydrogen atmosphere helps to reduce temperatures of all decomposition steps. The results of TPH were utilized to check the nature of residues in the products of lanthanum nitrate-to-oxide conversion performed via citrate-gel combustion technique.     

On the vector field problem for O(n)/O(1)xO(1)xO(n-2)

We prove new results about the vector field problem on the real flag manifolds O(n)/O(1) x O(1) x O(n - 2). For some infinite families of these manifolds, we completely solve the vector field problem.     

Division and <Emphasis Type="Italic">k</Emphasis>-th root theorems for <Emphasis Type="Italic">Q</Emphasis>-manifolds

We prove that a locally compact ANR-space X is a Q-manifold if and only if it has the Disjoint Disk Property (DDP), all points of X are homological Z _∞-points and X has the countable-dimensional approximation property (cd-AP), which means that each map f: K → X of a compact polyhedron can be approximated by a map with the countable-dimensional image. As an application we prove that a space X with DDP and cd-AP is a Q-manifold if some finite power of X is a Q-manifold. If some finite power of a space X with cd-AP is a Q-manifold, then X ² and X × [0, 1] are Q-manifolds as well. We construct a countable family χ of spaces with DDP and cd-AP such that no space X ∈ χ is homeomorphic to the Hilbert cube Q whereas the product X × Y of any different spaces X, Y ∈ χ is homeomorphic to Q. We also show that no uncountable family χ with such properties exists. This work was supported by the Slovenian-Ukrainian (Grant No. SLO-UKR 04-06/07)     

Precipitation and characterization of uniform submicrometer lead titanate particles. Part II: Reaction mechanism

The chemical mechanism of the precipitation of lead titanium peroxohydroxide particles in a solution of nitrilotriacetate (NTA) complexes of lead and titanium peroxo-hydroxide is envisioned as the interaction between cations of lead hydroxide and anions of polymeric titanium peroxo-hydroxide.     

Algorithms for ham-sandwich cuts

Given disjoint setsP ₁,P ₂, ...,P _d inR ^d withn points in total, ahamsandwich cut is a hyperplane that simultaneously bisects theP _i . We present algorithms for finding ham-sandwich cuts in every dimensiond>1. Whend=2, the algorithm is optimal, having complexityO(n). For dimensiond>2, the bound on the running time is proportional to the worst-case time needed for constructing a level in an arrangement ofn hyperplanes in dimensiond−1. This, in turn, is related to the number ofk-sets inR ^d−1 . With the current estimates, we get complexity close toO(n ^3/2 ) ford=3, roughlyO(n ^8/3 ) ford=4, andO(n ^d−1−a(d) ) for somea(d)>0 (going to zero asd increases) for largerd. We also give a linear-time algorithm for ham-sandwich cuts inR ³ when the three sets are suitably separated. A preliminary version of the results of this paper appeared in [16] and [17]. Part of this research by J. Matoušek was done while he was visiting the School of Mathematics, Georgia Institute of Technology, Atlanta, and part of his work on this paper was supported by a Humboldt Research Fellowship. W. Steiger expresses gratitude to the NSF DIMACS Center at Rutgers, and his research was supported in part by NSF Grants CCR-8902522 and CCR-9111491.